Implementing Hierarchical Graph-Structures
نویسنده
چکیده
We present concepts for the implementation of hierarchical graphs, which can be used as basis for the implementation of tools for graphical formal description techniques (gFDT) like SDL or statecharts. Our approach provides a strong modularity of a speciication by a loose coupling between diierent hierarchy levels and it serves for a rapid development of interactive editors for gFDTs by a special technique of describing hierarchy. Furthermore, this technique allows the reuse of graph editors in diierent applications. Our concepts are explained by means of the graphical design tool Moby/plc for a special class of real-time automata, called PLC-Automata.
منابع مشابه
Graph Clustering by Hierarchical Singular Value Decomposition with Selectable Range for Number of Clusters Members
Graphs have so many applications in real world problems. When we deal with huge volume of data, analyzing data is difficult or sometimes impossible. In big data problems, clustering data is a useful tool for data analysis. Singular value decomposition(SVD) is one of the best algorithms for clustering graph but we do not have any choice to select the number of clusters and the number of members ...
متن کاملApplications of Graph Operations
In this paper, some applications of our earlier results in working with chemical graphs are presented.
متن کاملHierarchical Control Flow Graph Models
Hierarchical Control Flow Graph Models deene a modeling paradigm for discrete event simulation modeling based upon hierarchical extensions to Control Flow Graph Models. Conceptually, models consist of a set of encapsulated, concurrently operating model components that interact solely via message passing. The primary objectives of Hierarchical Control Flow Graph Models are: (1) to facilitate mod...
متن کاملProgram Complexity Using Hierarchical Abstract Computers
There is currently interest in measuring the complexity of a computer program with the evaluation of a program's control structure via its flowgraph representation. 1,2 How~ ever, the inclusion of the effects of data on these measures is often lacking. This paper proposes a new measure of program complexity that attempts to identify regions of lo~ cality by combining a contro~ structure approac...
متن کاملStructure-Based Brushes: A Mechanism for Navigating Hierarchically Organized Data and Information Spaces
Interactive selection is a critical component in exploratory visualization, allowing users to isolate subsets of the displayed information for highlighting, deleting, analysis, or focussed investigation. Brushing, a popular method for implementing the selection process, has traditionally been performed in either screen space or data space. In this paper, we introduce an alternate, and potential...
متن کامل